Large Deviations for Past-Dependent Recursions
نویسنده
چکیده
The Large Deviation Principle is established for stochastic models defined by past-dependent non linear recursions with small noise. In the Markov case we use the result to obtain an explicit expression for the asymptotics of exit time.
منابع مشابه
Tail Asymptotics for the Supremum of an Independent Subadditive Process, with Applications to Monotone-separable Networks
Tail asymptotics for the supremum of an independent subadditive process are obtained as a function of the logarithmic moment generating function. We use this analysis to obtain large deviations results for queueing networks in their stationary regime. In the particular case of (max,plus)-linear recursions, the rate of exponential decay of the stationary solution can be explicitly computed.
متن کاملBlind Space-time Rake Structure based on Second Order Statistics for DS-CDMA
This paper presents a new algorithm that ensures low complexity implementation of a blind ST Rake receiver for DS-CDMA. The algorithm is applicable for both periodic and non-periodic spreading sequences provided that the system utilizes two layers of code separation: a spreading code layer and a scrambling code layer. The new method consists of two kinds of recursions: PAST recursions for a des...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملFUZZY LINEAR REGRESSION BASED ON LEAST ABSOLUTES DEVIATIONS
This study is an investigation of fuzzy linear regression model for crisp/fuzzy input and fuzzy output data. A least absolutes deviations approach to construct such a model is developed by introducing and applying a new metric on the space of fuzzy numbers. The proposed approach, which can deal with both symmetric and non-symmetric fuzzy observations, is compared with several existing models by...
متن کاملRecursion removal in fast matrix multiplication
Recursion’s removal improves the efficiency of recursive algorithms, especially algorithms with large formal parameters, such as fast matrix multiplication algorithms. In this article, a general method of breaking recursions in fast matrix multiplication algorithms is introduced, which is generalized from recursions removal of a specific fast matrix multiplication algorithm of Winograd.
متن کامل